Recursive Scene Graphs for Art and Design

نویسندگان

  • Brian Wyvill
  • Neil A. Dodgson
چکیده

Conventional scene graphs use directed acyclic graphs; conventional iterated function systems use infinitely recursive definitions. We investigate scene graphs with recursive cycles for defining graphical scenes. This permits both conventional scene graphs and iterated function systems within the same framework and opens the way for other definitions not possible with either. We explore several mechanisms for limiting the implied recursion in cyclic graphs, including both global and local limits. This approach permits a range of possibilities, including scenes with carefully controlled and locally varying recursive depth. It has applications in art and design.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predicting Implantation Outcome of In Vitro Fertilization and Intracytoplasmic Sperm Injection Using Data Mining Techniques

Objective The main purpose of this article is to choose the best predictive model for IVF/ICSI classification and to calculate the probability of IVF/ICSI success for each couple using Artificial intelligence. Also, we aimed to find the most effective factors for prediction of ART success in infertile couples. MaterialsAndMethods In this cross-sectional study, the data of 486 patients are colle...

متن کامل

On Support Relations and Semantic Scene Graphs

Rapid development of robots and autonomous vehicles requires semantic information about the surrounding scene to decide upon the correct action or to be able to complete particular tasks. Scene understanding provides the necessary semantic interpretation by semantic scene graphs. For this task, so-called support relationships which describe the contextual relations between parts of the scene su...

متن کامل

Perfect Matchings in Edge-Transitive Graphs

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...

متن کامل

Adaptive Virtual Screening of Drug-Like Molecules by Recursive Neural Networks for Undirected Graphs

Virtual screening of drug-like molecules is a very important task in drug design, but it is generally time consuming and expensive. In fact, the common practice of virtual screening requires a feature selection process that is performed by experts. The time necessary to accomplish it is long and often unpredictable. Moreover, given that even experts can fail, this hand-crafted selection process...

متن کامل

An Improved Motion Vector Estimation Approach for Video Error Concealment Based on the Video Scene Analysis

In order to enhance the accuracy of the motion vector (MV) estimation and also reduce the error propagation issue during the estimation, in this paper, a new adaptive error concealment (EC) approach is proposed based on the information extracted from the video scene. In this regard, the motion information of the video scene around the degraded MB is first analyzed to estimate the motion type of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010